The Maximum Size of an Edge Cut and Graph Homomorphisms
نویسندگان
چکیده
منابع مشابه
The Maximum Size of an Edge Cut and Graph Homomorphisms
For a graph G, let max : is an edge cut of b G D D G . For graphs G and H, a map :V G V H is a graph homomorphism if for each e uv E G , u v E H . In 1979, Erdös proved by probabilistic methods that for p ≥ 2 with
متن کاملThe complexity of signed graph and edge-coloured graph homomorphisms
The goal of this work is to study homomorphism problems (from a computational point of view) on two superclasses of graphs: 2-edge-coloured graphs and signed graphs. On the one hand, we consider the H-Colouring problem when H is a 2-edge-coloured graph, and we show that a dichotomy theorem would imply the dichotomy conjecture of Feder and Vardi. On the other hand, we prove a dichotomy theorem f...
متن کاملEdge-reflection positivity and weighted graph homomorphisms
B. Szegedy [Edge coloring models and reflection positivity, Journal of the American Mathematical Society 20 (2007) 969–988] showed that the number of homomorphisms into a weighted graph is equal to the partition function of a complex edge-coloring model. Using some results in geometric invariant theory, we characterize for which weighted graphs the edge-coloring model can be taken to be real va...
متن کاملUnifying Maximum Cut and Minimum Cut of a Planar Graph
Absfmcf-We consider the real-weight maximum cut of a planar graph. Given an undirected planar graph with real-valued weights associated with its edges, find a partition of the vertices into two nonemply sets such that the sum of the weights of the edges connecting the two sets is maximum. The conventional maximum cut and minimum cut problems assume nonnegative edge weights, and thus are special...
متن کاملSome Edge Cut Sets and an Upper bound for Edge Tenacity of Organic Compounds CnH2n+2
The graphs play an important role in our daily life. For example, the urban transport network can be represented by a graph, as the intersections are the vertices and the streets are the edges of the graph. Suppose that some edges of the graph are removed, the question arises, how damaged the graph is. There are some criteria for measuring the vulnerability of graph; the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics
سال: 2011
ISSN: 2152-7385,2152-7393
DOI: 10.4236/am.2011.210176